Multiple Choice Strategy For PSO Algorithm - Performance Analysis On Shifted Test Functions
نویسندگان
چکیده
A new promising strategy for the PSO (Particle swarm optimization) algorithm is proposed and described in this paper. This new strategy presents alternative way of assigning new velocity to each individual in particle swarm (population). This new multiple choice particle swarm optimization (MC-PSO) algorithm is tested on two different shifted test functions to show the performance on problems that are not constant in time. The promising results of this alternative strategy are compared with the not modified PSO version.
منابع مشابه
Performance of Multi-chaotic PSO on a Shifted Benchmark Functions Set
In this paper the performance of Multi-chaotic PSO algorithm is investigated using two shifted benchmark functions. The purpose of shifted benchmark functions is to simulate the time-variant real-world problems. The results of chaotic PSO are compared with canonical version of the algorithm. It is concluded that using the multi-chaotic approach can lead to better results in optimization of shif...
متن کاملEconomic Load Dispatch using PSO Algorithm Based on Adaptive Learning Strategy Considering Valve point Effect
Abstract: In recent years due to problems such as population growth and as a result increase in demand for electrical energy, power systems have been faced with new challenges that not existed in the past. One of the most important issues in modern power systems is economic load dispatch, which is a complex optimization problem with a large number of variables and constraints. Due to the comple...
متن کاملHuman Behavior-Based Particle Swarm Optimization
Particle swarm optimization (PSO) has attracted many researchers interested in dealing with various optimization problems, owing to its easy implementation, few tuned parameters, and acceptable performance. However, the algorithm is easy to trap in the local optima because of rapid losing of the population diversity. Therefore, improving the performance of PSO and decreasing the dependence on p...
متن کاملComparative performance analysis of various binary coded PSO algorithms in multivariable PID controller design
In this paper, comparative performance analysis of various binary coded PSO algorithms on optimal PI and PID controller design for multiple inputs multiple outputs (MIMO) process is stated. Four algorithms such as modified particle swarm optimization (MPSO), discrete binary PSO (DBPSO), modified discrete binary PSO (MBPSO) and probability based binary PSO (PBPSO) are independently realized usin...
متن کاملUsing the Particle Swarm Optimization Algorithm to Generate the Minimum Test Suite in Covering Array with Uniform Strength
Up to now, several useful algorithms have been proposed to generate covering array, which is one of the branches of combinatorial testing. The main challenge in generating such arrays is generation of the arrays with a minimum number of test cases (for efficiency) at a proper time (for performance), for large systems. Covering array generation strategies are often divided into two general categ...
متن کامل